Automatic Data Layout Using 0-1 Integer Programming

In the optimization world now, even the use of considering the number of processors for parallel programming is carefully considered. The goal of high-level languages is to provide a simple yet efficient machine-independent parallel programming model. The programmer’s data parallel programs should be able to compile and executed with a good performance on many different architectures. However the most sophisticated compiler may not be able to compensate for a poor chosen data layout since many compiler decisions are driven by the data layout specified in the program. Hence the procedure to select a good and efficient data layout is important. The data layout selection problem can be formulated as a 0-1 integer programming problem.